”Hard to Get, Easy to Lose” Endogenous Reputation and Underinvestment
نویسنده
چکیده
Reputation concerns may help to achieve efficiency in cases where imperfect information impedes it. In this paper I highlight the endogenous property of reputation and analyze how it undermines the effectiveness of reputation to achieve efficiency. More reputation implies the possibility of undertaking more activity. At the same time, more activity generates more signals under which reputation can be constructed faster and more precisely. Firms with low reputation have the incentives but not the demand to achieve efficiency. Firms with intermediate and high reputation may have the demand but not the incentives to achieve efficiency. High reputation firms have more room to lose reputation than to gain reputation. Covering the whole demand has short-term benefits from a large activity but has long-term costs from increasing the precision of signals and the magnitude of the potential loss of reputation, with the corresponding difficulty to build reputation back. The result is high reputation firms may decide to under-provide and under-invest.
منابع مشابه
Asymmetry of Reputation Loss and Recovery
We formulate a dynamic investment model where investors can easily change firms (funds) and firms’ actions are subject to imperfect monitoring. We show that there is an asymmetry of fast reputation loss and slow reputation recovery, even without informational externalities. The key factor is endogenous relationships. It is easy to lose customers but it is not easy to get them back, because with...
متن کاملAsymmetry of Reputation Loss and Recovery under Endogenous Relationships: Theory and Evidence∗
We formulate a dynamic investment model where investors can easily change firms (funds) and firms’ actions are subject to imperfect monitoring. We show that there is an asymmetry of fast customer loss and slow recovery, without learning or asymmetry in feasible actions at different states. The key factor is endogenous relationships. It is easy to lose customers but it is not easy to get them ba...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملRESCUE: Reputation based Service for Cloud User Environment
Exceptional characteristics of Cloud computing has replaced all traditional computing. With reduced resource management and without in-advance investment, it has been victorious in making the IT world to migrate towards it. Microsoft announced its office package as Cloud, which can prevent people moving from Windows to Linux. As this drift is escalating in an exponential rate, the cloud environ...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کامل